Requiring chords in cycles
نویسندگان
چکیده
منابع مشابه
Requiring chords in cycles
R. E. Jamison proved that every cycle of length greater than three in a graph has a chord—in other words, the graph is chordal—if and only if every k-cycle is the sum of k − 2 triangles. This result generalizes to having or not having crossing chords and to having strong chords, with similar characterizations of a variety of graph classes that includes chordal bipartite, distance-hereditary, an...
متن کاملChords of Longest Cycles in Cubic Graphs
We describe a general sufficient condition for a Hamiltonian graph to contain another Hamiltonian cycle. We apply it to prove that every longest cycle in a 3-connected cubic graph has a chord. We also verify special cases of an old conjecture of Sheehan on Hamiltonian cycles in 4-regular graphs and a recent conjecture on a second Hamiltonian cycle by Triesch, Nolles, and Vygen. 1997 Academic Press
متن کاملThe i-chords of cycles and paths
An i-chord of a cycle or path is an edge whose endpoints are a distance i ≥ 2 apart along the cycle or path. Motivated by many standard graph classes being describable by the existence of chords, we investigate what happens when i-chords are required for specific values of i. Results include the following: A graph is strongly chordal if and only if, for i ∈ {4, 6}, every cycle C with |V (C)| ≥ ...
متن کاملHamiltonian cycles with all small even chords
Let G be a graph of order n ≥ 3. An even squared hamiltonian cycle (ESHC) of G is a hamiltonian cycle C = v1v2 . . . vnv1 of G with chords vivi+3 for all 1 ≤ i ≤ n (where vn+j = vj for j ≥ 1). When n is even, an ESHC contains all bipartite 2-regular graphs of order n. We prove that there is a positive integer N such that for every graph G of even order n ≥ N , if the minimum degree δ(G) ≥ n 2 +...
متن کاملOn friendly index sets of cycles with parallel chords
Let G be a graph with vertex set V(G) and edge set E(G), and let A be an abelian group. A labeling f: V(G) A induces an edge labeling f"': E(G) A defined by f"'(xy) = f(x) + fey), for each edge xy e E(G). For i e A, let vt<i) = card { v e V(G) : f(v) = i} and er(i) = card ( e e E(G) : f"'(e) = i}. Let c(f) = {Iet<i) etG)1 : (i, j) e A x A}. A labeling f of a graph G is said to be A friendly if...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2005
ISSN: 0012-365X
DOI: 10.1016/j.disc.2005.04.009